منابع مشابه
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-perfect token distribution problem redistributes the tokens in a minimum number of steps, so that, at the end, no more than O(l) tokens reside at each node. (In perfect distribution, at the end, exactly one token resid...
متن کاملTransition-Optimal Token Distribution
There is given a graph, that models a communication network of a multi-processor system, and there are tokens (jobs) allocated to nodes of the graph. The task is to distribute the tokens evenly, subject to the constraint that they may be moved only along the edges of the graph. The cost of a distribution strategy is measured as the total number of operations of moving a token along an edge. An ...
متن کاملOn Perfect and Near-perfect Numbers
We call n a near-perfect number if n is the sum of all of its proper divisors, except for one of them, which we term the redundant divisor. For example, the representation 12 = 1 + 2 + 3 + 6 shows that 12 is near-perfect with redundant divisor 4. Near-perfect numbers are thus a very special class of pseudoperfect numbers, as defined by Sierpiński. We discuss some rules for generating near-perfe...
متن کاملStrongly Adaptive Token Distribution 1
The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: let M be a (parallel processor) network with setP of processors. Initially, each processor P ∈ P has a certain amount l(P) of tokens. The goal of a TD algorithm, run on M , is to distribute the tokens evenly among the processors. In this paper we introduce the notion of strongly adaptive TD...
متن کاملFast Token Distribution on Recon gurable Meshes
The token distribution problem is an important data distribution problem akin to the problems of sorting and routing, in which data elements, or tokens-must be evenly distributed amongst the processors of a parallel network. To date, all algorithms to solve this problem on the mesh and reconngurable mesh architectures have lagged (in terms of the time required to obtain a solution) the state-of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 1994
ISSN: 1042-9832
DOI: 10.1002/rsa.3240050406